Computational problem - PDFSEARCH.IO - Document Search Engine

Computational problem
Results: 1172

#	Item
51	Space-Efficient Randomized Algorithms for K-SUM Joshua R. Wang Stanford University, Stanford CA 94305, USA Add to Reading List Source URL: web.stanford.edu Language: English - Date: 2014-04-18 04:16:48 Mathematics Search algorithms Information retrieval Information science Hashing Analysis of algorithms Cryptographic hash functions Computational complexity theory Universal hashing Hash function Randomized algorithm Subset sum problem
52	TSPLIB in XML format To facilitate the usage of the classical TSPLIB by Gerhard Reinelt, we now offer the data of the well-known test instances also in an XML data format, both for the symmetric and the asymmetric travel Add to Reading List Source URL: comopt.ifi.uni-heidelberg.de Language: English - Date: 2013-06-19 04:16:58 Graph theory Mathematics Computational complexity theory NP-complete problems Graph Travelling salesman problem Vertex Cycle Hamiltonian path Graph automorphism Vertex cover
53	LNCSFixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction Add to Reading List Source URL: www.cs.tau.ac.il Language: English - Date: 2009-01-01 08:42:54 Computational complexity theory Graph theory Mathematics Phylogenetics NP-complete problems Computational phylogenetics Analysis of algorithms Probabilistic complexity theory Randomized algorithm Steiner tree problem Algorithm Maximum parsimony
54	2nd Student Workshop on Ecology and Optics of Coastal Zones, 2016 Kaliningrad, Russia, 19-23 JulyARTIFICIAL NEURAL NETWORKS AND THEIR APPLICATION Add to Reading List Source URL: www.earsel.org Language: English - Date: 2016-07-18 12:44:41 Artificial neural network Computational neuroscience Mathematical psychology Spectroscopy Inverse problem Applied mathematics Academia
55	From Convex Optimization to Randomized Mechanisms: Toward Optimal Combinatorial Auctions∗ Shaddin Dughmi† Tim Roughgarden‡ Add to Reading List Source URL: www.qiqiyan.com.s3-website-us-east-1.amazonaws.com Language: English - Date: 2012-07-04 18:28:36 Mathematical optimization Mathematics Operations research Linear programming Convex optimization Combinatorial optimization Computational complexity theory Submodular set function Randomized rounding Optimization problem Matroid Ellipsoid method
56	CS364B: Frontiers in Mechanism Design Lecture #8: MIR and MIDR Mechanisms∗ Tim Roughgarden† January 29, Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-02-19 21:14:11 Mechanism design Computational complexity theory Game theory Decision theory VickreyClarkeGroves auction VickreyClarkeGroves mechanism Incentive compatibility Knapsack problem Randomized rounding Time complexity Random-sampling mechanism Bayesian-optimal mechanism
57	A Constant-Factor Approximation Algorithm for the Multicommodity Rent-or-Buy Problem Amit Kumar ∗ Anupam Gupta† Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2004-09-21 15:30:36 Graph theory Mathematics Computational complexity theory NP-complete problems Combinatorial optimization Edsger W. Dijkstra Spanning tree Operations research Shortest path problem Graph Linear programming Steiner tree problem
58	IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL. 26, NO. X, Add to Reading List Source URL: www.cs.uoi.gr Language: English - Date: 2014-10-21 22:17:09 Mathematics Operations research Computational complexity theory Combinatorics Combinatorial optimization NP-complete problems Set cover problem Greedy algorithm Heuristic Integer programming Matching Linear programming
59	Introduction to Algorithms Massachusetts Institute of Technology Professors Erik Demaine, Piotr Indyk, and Manolis Kellis May 19, Spring 2011 Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2011-05-20 09:43:49 Computational complexity theory Mathematics Theory of computation Analysis of algorithms Operations research Asymptotic analysis Combinatorial optimization Dynamic programming Master theorem Big O notation Knapsack problem Time complexity
60	Approximation Via Cost-Sharing: A Simple Approximation Algorithm for the Multicommodity Rent-or-Buy Problem Anupam Gupta∗ Amit Kumar† Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2004-09-21 15:30:39 Graph theory Mathematics Computational complexity theory NP-complete problems Steiner tree problem XTR Shortest path problem Flow network Maximum flow problem Graph coloring